package editor.cn;

//You are given an m x n integer grid accounts where accounts[i][j] is the amoun
//t of money the ith customer has in the jth bank. Return the wealth that the rich
//est customer has. 
//
// A customer's wealth is the amount of money they have in all their bank accoun
//ts. The richest customer is the customer that has the maximum wealth. 
//
// 
// Example 1: 
//
// 
//Input: accounts = [[1,2,3],[3,2,1]]
//Output: 6
//Explanation:
//1st customer has wealth = 1 + 2 + 3 = 6
//2nd customer has wealth = 3 + 2 + 1 = 6
//Both customers are considered the richest with a wealth of 6 each, so return 6
//.
// 
//
// Example 2: 
//
// 
//Input: accounts = [[1,5],[7,3],[3,5]]
//Output: 10
//Explanation: 
//1st customer has wealth = 6
//2nd customer has wealth = 10 
//3rd customer has wealth = 8
//The 2nd customer is the richest with a wealth of 10. 
//
// Example 3: 
//
// 
//Input: accounts = [[2,8,7],[7,1,3],[1,9,5]]
//Output: 17
// 
//
// 
// Constraints: 
//
// 
// m == accounts.length 
// n == accounts[i].length 
// 1 <= m, n <= 50 
// 1 <= accounts[i][j] <= 100 
// 
// Related Topics 数组 
// 👍 7 👎 0

public class RichestCustomerWealth{
    public static void main(String[] args) {
        Solution solution = new RichestCustomerWealth().new Solution();
        
    }

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int maximumWealth(int[][] accounts) {
        int max = 0;
        for (int i = 0; i < accounts.length; i++) {
            int count = 0;
            for (int j = 0; j < accounts[i].length; j++) {
                count += accounts[i][j];
            }
            max = Math.max(max, count);
        }
        return max;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}